Intensionality and circumscription

نویسنده

  • Graham White
چکیده

This paper examines the semantics of a group of logical techniques, used by the Artificial Intelligence community, and which are fundamental for circumscriptionbased approaches to the situation calculus. At first sight, this calculus appears to be an operationalised version of David Lewis’ account of causal reasoning: there are items – here called ‘situations’ – which are analogous to Lewis’ possible worlds, and one finds the situation which is the result of an action by minimising difference: that is, if an action is performed in a situation s, then the situation resulting from the action is that situation which, among all of those in which the effects of the action hold, is minimally different from s.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factives and Intensionality

Notion of normal intensionality and of intensionality preserving negation are introduced. Both these notions apply to intensional sentential operators. When applied to factive operators they allows us to understand the way these operators give rise to presuppositions and their duals, assertions. They allow us also to distinguish semantically emotive factives from non-emotive ones.

متن کامل

On Reducing Parallel Circumscription

Three levels of circumscription have been proposed by McCathy to formalize common sense knowledge and non-monotonic reasoning in general-purpose database and knowledge base systems. That is, basic circumscription, parallel circumscription, and priority circumscription. Basic circumscription is a special case of parallel circumscription while parallel circumscription is a special case of priorit...

متن کامل

A Higher-order Fine-grained Logic for Intensional Semantics

This paper describes a higher-order logic with fine-grained intensionality (FIL). Unlike traditional Montogovian type theory, intensionality is treated as basic, rather than derived through possible worlds. This allows for fine-grained intensionality without impossible worlds. Possible worlds and modalities are defined algebraically. The proof theory for FIL is given as a set of tableau rules, ...

متن کامل

Expressiveness via Intensionality and Concurrency

Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the λ-calculus. However, recent work shows that there are more expressive intensional calculi such as S F-calculus. Traditionally process calculi capture computation by encoding the λ-calculus, ...

متن کامل

Pointwise Circumscription Revisited

A decade ago, Pointwise Circumscription was proposed as a tool for formalizing common sense. In this paper, we revisit some of its uses and examine some cases in which it does not yield the intended behavior. Specifically, we explore the cases in which unsatisfiability may result from the presence of multiple minimal models (for McCarthy’s Circumscription). Then, we present a form of circumscri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002